Occupation Statistics of Critical Branching Random Walks

نویسندگان

  • Steven Lalley
  • Xinghua Zheng
چکیده

We consider a critical nearest neighbor branching random walk on the d−dimensional integer lattice. Denote by Vm the maximal number of particles at a single site at time m, and by Gm the event that the branching random walk survives to generation m. We show that if the offspring distribution has finite n-th moment, then in dimensions d ≥ 3, conditional on Gm, Vm = Op(m 1 n ); and if the offspring distribution has exponentially decaying tail, then, conditional on Gm, (a) Vm = Op(logm) in dimensions d ≥ 3, and (b) Vm = Op((logm)2) in dimension d = 2. On the other hand, we show that if the offspring distribution is non-degenerate then P (Vm ≥ δ logm|Gm) → 1 for some δ > 0. Therefore, in dimensions d ≥ 3, if the offspring distribution has exponentially decaying tail then conditional on Gm, the distribution of Vm/logm must converge to a nontrivial limit as m → ∞. Furthermore, we show that, conditional on Gm, in dimensions d ≥ 3, the number of multiplicity-j sites, j ≥ 1, and the number of occupied sites, normalized by m, converge jointly to multiples of an exponential random variable; in dimension d = 2, however, the number of particles on a ‘typical’ site is Op(logm), and the number of occupied sites is Op(m/ logm).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Occupation Statistics of Critical Branching Random Walks in Two or Higher Dimensions

Consider a critical nearest neighbor branching random walk on the d-dimensional integer lattice initiated by a single particle at the origin. Let Gn be the event that the branching random walk survives to generation n. We obtain limit theorems conditional on the event Gn for a variety of occupation statistics: (1) Let Vn be the maximal number of particles at a single site at time n. If the offs...

متن کامل

A functional CLT for the occupation time of state-dependent branching random walk

We show that the centred occupation time process of the origin of a system of critical binary branching random walks in dimension d ≥ 3, started off either from a Poisson field or in equilibrium, when suitably normalised, converges to a Brownian motion in d ≥ 4. In d = 3, the limit process is fractional Brownian motion with Hurst parameter 3/4 when starting in equilibrium, and a related Gaussia...

متن کامل

Characterization of the Critical Values of Branching Random Walks on Weighted Graphs through Infinite-type Branching Processes

We study the branching random walk on weighted graphs; site-breeding and edgebreeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We characterize the weak critical value and relate it to another geometrical parameter. We prove that, at the strong critical value, the process dies out locall...

متن کامل

Occupation Time Limit Theorems for Independent Random Walks

We summarize many limit theorems for systems of independent simple random walks in Z. These theorems are classiied into four classes: weak convergence, moderate deviations, large deviations and enormous deviations. A hierarchy of relations is pointed out and some open problems are posed. Extensions to function spaces are also mentioned. 1. Introduction In this paper we review many results on th...

متن کامل

2 9 Ja n 20 04 DEGREES OF TRANSIENCE AND RECURRENCE AND HIERARCHICAL RANDOM WALKS

The notion of degree and related notions concerning recurrence and transience for a class of Lévy processes on metric Abelian groups are studied. The case of random walks on a hierarchical group is examined with emphasis on the role of the ultrametric structure of the group and on analogies and differences with Euclidean random walks. Applications to separation of time scales and occupation tim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007